Reconstruction of a persistent random walk from exit time distributions

نویسندگان

  • Pak-Wing Fok
  • Qunhui Han
  • Tom Chou
چکیده

In this paper, we study the inverse problem of reconstructing the spatially dependent transition rate F (x) of a one-dimensional Broadwell process from exit time distributions. In such a process, an advecting particle is assumed to undergo transitions between states with constant positive (+v) and negative (−v) velocities. The goal is to reconstruct the transition rate function F (x) from the exit time distributions out of a finite interval. Using the associated backward equation, we compute the distribution of exit times and its Laplace transform, given a fixed starting position and velocity. We propose two methods (called ‘t’ and ‘s’) for finding F (x). In both methods, we represent F (x) as a linear combination of polynomials and repeatedly solve the backward equation to minimize the difference between its solution and given first exit time data. In the t-method we work in the time domain, using exit times directly and leveraging a novel series solution for the exit time distribution. In the s-method, we work with the Laplace-transformed equation and Laplace-transformed exit times. Noisy data is generated using a custom-designed algorithm to simulate the trajectories of a Broadwell process. In most cases we can find 4 coefficients to within O(10−1) accuracy from O(104) exit times, with the t-method method slightly out-performing the s-method. We also explore the effectiveness of our algorithms for a fixed number of exit times under different advection speeds and find that optimal reconstruction occurs when v = O(1).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Space-time Random Walk for Stochastic Differential Equations in a Bounded Domain

A mean-square approximation, which ensures boundedness of both time and space increments, is considered for stochastic di erential equations in a bounded domain. The proposed algorithm is based on a space-time discretization using a random walk over boundaries of small space-time parallelepipeds. To realize the algorithm, exact distributions for exit points of the space-time Brownian motion fro...

متن کامل

Reconstructing the Transition Rate Function of a Broadwell Random Walk from Exit Times

In this paper, we utilize the layer stripping method, a method used in seismology by geophysicists, to study a stochastic inverse problem arising from a one-dimensional Broadwell process. The Broadwell process can be described as a random walk of a particle that transitions, with a spatially dependent flip rate, between two states associated with the same speed but with different signs of veloc...

متن کامل

A PRELUDE TO THE THEORY OF RANDOM WALKS IN RANDOM ENVIRONMENTS

A random walk on a lattice is one of the most fundamental models in probability theory. When the random walk is inhomogenous and its inhomogeniety comes from an ergodic stationary process, the walk is called a random walk in a random environment (RWRE). The basic questions such as the law of large numbers (LLN), the central limit theorem (CLT), and the large deviation principle (LDP) are ...

متن کامل

On the Exit Time of a Random Walk with Positive Drift

We study a random walk with positive drift in the first quadrant of the plane. For a given connected region C of the first quadrant, we analyze the number of paths contained in C and the first exit time from C. In our case, region C is bounded by two crossing lines. It is noted that such a walk is equivalent to a path in a tree from the root to a leaf not exceeding a given height. If this tree ...

متن کامل

From persistent random walks to the telegraph noise

We study a family of memory-based persistent random walks and we prove weak convergences after space-time rescaling. The limit processes are not only Brownian motions with drift. We have obtained a continuous but non-Markov process (Zt) which can be easely expressed in terms of a counting process (Nt). In a particular case the counting process is a Poisson process, and (Zt) permits to represent...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013